Correspondence analysis for strong three-valued logic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three-Valued Semantics for Extended Logic Programs

In 4] , the semantics of monotonic (i.e. not-free) extended logic programs (ELPs) has been rephrased in three-valued logic for two purposes: achieving tractable reasoning with incomplete information and understanding the relationships between the existing semantics and many-valued logics. In this paper, we generalize this approach to unrestricted ELPs. We obtain a unifying view of many formalis...

متن کامل

A three-valued semantics for logic programmers

This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer’s interpretation of a program), procedural semantics (for example, SLD resolution) and fixpoint semantics (which is useful for program analysis and alt...

متن کامل

Programming in Three-valued Logic

The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...

متن کامل

Learning Three-Valued Logic Programs

We show that the adoption of a three-valued setting for inductive concept learning is particularly useful for learning. Distinguishing between what is true, what is false and what is unknown can be useful in situations where decisions have to be taken on the basis of scarce information. In order to learn in a three-valued setting, we adopt Extended Logic Programs (ELP) under a Well-Founded Sema...

متن کامل

Refinement-based Programverification via Three-valued-logic Analysis

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Investigations

سال: 2014

ISSN: 2413-2713,2074-1472

DOI: 10.21146/2074-1472-2014-20-0-253-266